Fast point-to-point shortest path queries on dynamic road networks with interfal data
نویسندگان
چکیده
منابع مشابه
Fast paths on dynamic road networks
A recent industrial challenge for traffic information providers is to be able to compute point-to-point shortest paths very efficiently on road networks involving millions of nodes and arcs, where the arc costs represent travelling times that are updated every few minutes when new traffic information is available. Such stringent constraints defy classic shortest path algorithms. In this paper w...
متن کاملAn Experimental Evaluation of Point-To-Point Shortest Path Calculation on Road Networks with Precalculated Edge-Flags
We present an efficient algorithm for fast and exact calculation of shortest paths in graphs with geometrical information in nodes (coordinates), e.g. road networks. The method is based on preprocessing and therefore best suited for static graphs, i.e., graphs with fixed topology and edge costs. In the preprocessing phase, the network is divided into regions and edge flags are calculated that i...
متن کاملFast point-to-point shortest path queries on dynamic road networks with interval data
Consider a weighted directed graph G = (V,A, c) (where c : A → R+) which represents a road network evaluated by travelling times (so the graph may not be Euclidean). Assuming that c changes every few minutes, that the cardinality of V is very large (several million vertices), and that each shortest path request must be answered in a few milliseconds, current technology does not allow us to find...
متن کاملFast Point-to-Point Shortest Path Computations with Arc-Flags
We present a number of improvements of the basic variant of the arc-flag acceleration (Lauther, 1997, 2004) for point-to-point (P2P) shortest path computations on large graphs. Arc-flags are a modification to the standard Dijkstra algorithm and are used to avoid exploring unnecessary paths during shortest path computation. We assume that for the same input graph the shortest path problem has to...
متن کاملExploring Graph Partitioning for Shortest Path Queries on Road Networks
Computing the shortest path between two locations in a road network is an important problem that has found numerous applications. The classic solution for the problem is Dijkstra’s algorithm [1]. Although simple and elegant, the algorithm has proven to be inefficient for very large road networks. To address this deficiency of Dijkstra’s algorithm, a plethora of techniques that introduce some pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007